Optimal Cheeger cuts and bisections of random geometric graphs
نویسندگان
چکیده
منابع مشابه
Random Walks and Bisections in Random Circulant Graphs
Abstract. Using number theoretical tools, we prove two main results for random r-regular circulant graphs with n vertices, when n is sufficiently large and r is fixed. First, for any fixed ε > 0, prime n and L ≥ n(log n), walks of length at most L terminate at every vertex with asymptotically the same probability. Second, for any n, there is a polynomial time algorithm to find a vertex bisector...
متن کاملAlmost optimal sparsification of random geometric graphs
A random geometric irrigation graph Γn(rn, ξ) has n vertices identified by n independent uniformly distributed points X1, . . . , Xn in the unit square [0, 1]. Each point Xi selects ξi neighbors at random, without replacement, among those points Xj (j 6= i) for which ‖Xi − Xj‖ < rn, and the selected vertices are connected to Xi by an edge. The number ξi of the neighbors is an integer-valued ran...
متن کاملTotal Variation, Cheeger Cuts
In this work, inspired by (Bühler & Hein, 2009), (Strang, 1983), and (Zhang et al., 2009), we give a continuous relaxation of the Cheeger cut problem on a weighted graph. We show that the relaxation is actually equivalent to the original problem. We then describe an algorithm for finding good cuts suggested by the similarities of the energy of the relaxed problem and various well studied energi...
متن کاملBisections of graphs
A bisection of a graph is a bipartition of its vertex set in which the number of vertices in the two parts differ by at most 1, and its size is the number of edges which go across the two parts. In this paper, motivated by several questions and conjectures of Bollobás and Scott, we study maximum bisections of graphs. First, we extend the classical Edwards bound on maximum cuts to bisections. A ...
متن کاملConsistency of Cheeger and Ratio Graph Cuts
This paper establishes the consistency of a family of graph-cut-based algorithms for clustering of data clouds. We consider point clouds obtained as samples of a ground-truth measure. We investigate approaches to clustering based on minimizing objective functionals defined on proximity graphs of the given sample. Our focus is on functionals based on graph cuts like the Cheeger and ratio cuts. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2020
ISSN: 1050-5164
DOI: 10.1214/19-aap1534